import java.util.*;
import java.io.*;
public class Main {
    //BC149 简写单词
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {
            String s=in.next();
            s=s.toUpperCase();//需要注意:s转换为大写后要重新赋值
            System.out.print(s.charAt(0));
        }
    }


    //dd爱框框(要加上自定义输入输出才能通过)
    //注意题目要求:给的n个数a[1],a[2],a[3]...
    //题目这个狗,下标是从1开始的而不是0
    public static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    public static Read in = new Read();
    public static void main1(String[] args) throws IOException{

        int n = in.nextInt();
        int x = in.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
        }

        int left = 0;
        int count = 0;
        int minlen = Integer.MAX_VALUE;
        int start = 0;

        for (int right = 0; right < n; right++) {
            count += arr[right];

            // 只要当前窗口和大于等于 x，尝试收缩窗口
            while (count >= x) {
                if (minlen > (right - left + 1)) {
                    minlen = right - left + 1;
                    start = left;
                }
                count -= arr[left++];
            }
        }

        // 输出最小区间的 1-based 索引
        out.print((start + 1) + " ");
        out.println((start + minlen));
        out.close();
    }



    //牛客网除2!
    public static void main3(String[] args) throws IOException{
        BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
        String[] arr=reader.readLine().split(" ");
        int n = Integer.parseInt(arr[0]);
        int k = Integer.parseInt(arr[1]);
        String[] str=reader.readLine().split(" ");
        PriorityQueue<Integer> maxQueue = new PriorityQueue<>((a,b)->{
            return b-a;
        });
        long res=0;

        for(int i=0;i<n;i++){
            long num = Integer.parseInt(str[i]);
            if(num%2==1){
                res+=num;
            }else{
                maxQueue.offer((int)num);
            }
        }

        while(k>0&&!maxQueue.isEmpty()){
            int max=maxQueue.peek();
            int x=max/2;
            if(x%2==1){
                res+=x;
                maxQueue.poll();
            }else{
                maxQueue.poll();
                maxQueue.offer(x);
            }
            k--;
        }
        while(!maxQueue.isEmpty()){
            res+=maxQueue.poll();
        }
        System.out.print(res);
    }
}
class Read // 自定义快速读入
{
    StringTokenizer st = new StringTokenizer("");
    BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
    String next() throws IOException
    {
        while(!st.hasMoreTokens())
        {
            st = new StringTokenizer(bf.readLine());
        }
        return st.nextToken();
    }

    String nextLine() throws IOException
    {
        return bf.readLine();
    }

    int nextInt() throws IOException
    {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException
    {
        return Long.parseLong(next());
    }

    double nextDouble() throws IOException
    {
        return Double.parseDouble(next());
    }



}
